The splittable flow arc set with capacity and minimum load constraints
نویسنده
چکیده
We study the convex hull of the splittable flow arc set with capacity and minimum load constraints. This set arises as a relaxation of problems where clients have demand for a resource that can be installed in integer amounts and that has capacity limitations and lower bounds on utilization. We prove that the convex hull of this set is the intersection of the convex hull of the set with a capacity constraint and the convex hull of the set with a minimum load constraint. © 2013 Elsevier B.V. All rights reserved.
منابع مشابه
A Branch and Price algorithm for the k-splittable maximum flow problem
The Maximum Flow Problem with flow width constraints is a NP-hard problem. Two models are proposed: the first model is a compact node-arc model using two flow conservation blocks per path. For each path, one block defines the path while the other one send the right amount of flow on it. The second model is an extended arc-path model. It is obtained from the first model after a Dantzig-Wolfe ref...
متن کاملOn splittable and unsplittable flow capacitated network design arc-set polyhedra
We study the polyhedra of splittable and unsplittable single arc–set relaxations of multicommodity flow capacitated network design problems. We investigate the optimization problems over these sets and the separation and lifting problems of valid inequalities for them. In particular, we give a linear–time separation algorithm for the residual capacity inequalities [19] and show that the separat...
متن کاملBranch-and-Price-and-Cut for Single-Commodity Fixed-Charge Network Flow Problems
We consider the single-commodity single-origin fixed-charge network flow problem (SSFNP) defined on a directed network G = (V,A), where V is the node set and A is the arc set, with each arc a represented by the ordered pair of head and tail nodes (h(a), t(a)). The node set includes a single origin (with no incoming arc), multiple destinations (with no outgoing arc) and transshipment nodes (with...
متن کاملDynamic Load Carrying Capacity of Flexible Manipulators Using Finite Element Method and Pontryagin’s Minimum Principle
In this paper, finding Dynamic Load Carrying Capacity (DLCC) of flexible link manipulators in point to-point motion was formulated as an optimal control problem. The finite element method was employed for modelling and deriving the dynamic equations of the system. The study employed indirect solution of optimal control for system motion planning. Due to offline nature of the method, many diffic...
متن کاملCapacity inverse minimum cost flow problem
Given a directed graph G = (N,A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacity vector û for the arc set A such that a given feasible flow x̂ is optimal with respect to the modified capacities. Among all capacity vectors û satisfying this condition, we would like to find one with minimum ‖û− u‖ value....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 41 شماره
صفحات -
تاریخ انتشار 2013